Dynamical resource theory of quantum coherence
نویسندگان
چکیده
منابع مشابه
Quantum Information Approach to Dynamical Diffraction Theory
J. Nsofini, 2, ∗ K. Ghofrani, D. Sarenac, 2 D. G. Cory, 3, 4, 5 and D. A. Pushin 2 Department of Physics, University of Waterloo, Waterloo, ON, Canada, N2L3G1 Institute for Quantum Computing, University of Waterloo, Waterloo, ON, Canada, N2L3G1 Department of Chemistry, University of Waterloo, Waterloo, ON, Canada, N2L3G1 Perimeter Institute for Theoretical Physics, Waterloo, ON, Canada, N2L2Y5 ...
متن کاملQuantum Representation Theory for Nonlinear Dynamical Automata
Nonlinear dynamical automata (NDAs) are implementations of Turing machines by nonlinear dynamical systems. In order to use them as parsers, the whole string to be processed has to be encoded in the initial conditions of the dynamics. This is, however, rather unnatural for modeling human language processing. I shall outline an extension of NDAs that is able to cope with that problem. The idea is...
متن کاملDynamical mean-field theory for quantum chemistry.
The dynamical mean-field concept of approximating an unsolvable many-body problem in terms of the solution of an auxiliary quantum impurity problem, introduced to study bulk materials with a continuous energy spectrum, is here extended to molecules, i.e., finite systems with a discrete energy spectrum. The application to small clusters of hydrogen atoms yields ground state energies which are co...
متن کاملOn group theory for quantum gates and quantum coherence
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and stabilizing gates within an extension group C. In this paper one explores the nice adequacy between group theoretical concepts such as commutators, normal subgroups...
متن کاملGroup theory for quantum gates and quantum coherence
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and stabilizing gates within an extension group C. In this communication we explore the nice adequacy between group theoretical concepts such as commutators, normal sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Research
سال: 2020
ISSN: 2643-1564
DOI: 10.1103/physrevresearch.2.023298